Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
نویسندگان
چکیده
منابع مشابه
Single-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملMachine scheduling with earliness, tardiness and non-execution penalties
The study of scheduling problems with earliness–tardiness (E/T) penalties is motivated by the just-in-time (JIT) philosophy, which supports the notion that earliness, as well as tardiness, should be discouraged. In this work, we consider several scheduling problems. We begin by generalizing a known polynomial time algorithm that calculates an optimal schedule for a given sequence of tasks, on a...
متن کاملSolving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
متن کاملA branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
This paper considers the problem of scheduling a single machine, in which the objective function is to minimize the weighted quadratic earliness and tardiness penalties and no machine idle time is allowed. We develop a branch and bound algorithm involving the implementation of lower and upper bounding procedures as well as some dominance rules. The lower bound is designed based on a lagrangian ...
متن کاملPreemption in Single Machine Earliness/Tardiness Scheduling
We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Using completion time information obtained from the optimal solution to a preemptive relaxation, we generate feasible solutions to the original non-preemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1978
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.26.6.1079